Confluence and Critical-Pair-Closing Systems∗
نویسندگان
چکیده
In this note we introduce critical-pair-closing systems which are aimed at analyzing confluence of term rewriting systems. Based on the notion two new confluence criteria are presented. One is a generalization of weak orthogonality based on relative termination, and another is a partial solution to the RTA Open Problem #13.
منابع مشابه
Confluence of Typed Attributed Graph Transformation Systems
The issue of confluence is of major importance for the successful application of attributed graph transformation, such as automated translation of UML models into semantic domains. Whereas termination is undecidable in general and must be established by carefully designing the rules, local confluence can be shown for term rewriting and graph rewriting using the concept of critical pairs. In thi...
متن کاملAbstract Critical Pairs and Confluence of Arbitrary Binary Relations
Critical Pairs and Confluence of Arbitrary Binary Relations Rémy Haemmerlé and François Fages Projet Contraintes – INRIA Rocquencourt – France [email protected] Abstract. In a seminal paper, Huet introduced abstract properties of term rewriting systems, and the confluence analysis of terminating term rewriting systems by critical pairs computation. In this paper, we provide an abstrac...
متن کاملConfluent Term Rewriting for Only-knowing Logics
Combining term rewriting and modal logics, this paper addresses confluence and termination of rewrite systems introduced for only-knowing logics. The rewrite systems contain a rule scheme that gives rise to an infinite number of critical pairs, hence we cannot check the joinability of every critical pair directly, in order to establish local confluence. We investigate conditions that are suffic...
متن کاملConfluence of Graph Transformation Revisited
It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the mere existence of common reducts for all critical pairs of a graph rewriting system does not imply...
متن کاملTowards Local Confluence Analysis for Amalgamated Graph Transformation
Amalgamated graph transformation allows to define schemes of rules coinciding in common core activities and differing over additional parallel independent activities. Consequently, a rule scheme is specified by a kernel rule and a set of extending multi-rules forming an interaction scheme. Amalgamated transformations have been increasingly used in various modeling contexts. Critical Pair Analys...
متن کامل